// Copyright [2020] <unknown>
#include <bits/stdc++.h>
using namespace std;
// #define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
#define dbg(x...) { cerr << "\033[32;1m" << #x << " -> "; err(x); }
void err() { cerr << "\033[39;0m" << endl; }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }
#else
#define dbg(...)
#endif

#define sz(x) ((int)x.size())

typedef long long LL;

int t, n;
const int N = 1e5+50;

pair<int, int> a[N];
pair<LL, int> b[N];


// struct dsu {
//     int f[N];
//     inline int find(int x) {
//         return x == f[x]? x : (f[x] = find(f[x]));
//     }
// }

inline LL sqr(int x) { return 1LL * x * x; }

int main(int argc, char const *argv[]) {
    // code
    scanf("%d", &n);
    for (int i=0; i<n; ++i) {
        scanf("%d%d", &a[i].first, &a[i].second);
        b[i].first = 1LL * a[i].second * sqr(a[i].second - a[i].first);
        b[i].second = i;
    }
    sort(b, b+n);
    LL ans = 0;
    for (int i=1; i<n; ++i)
        ans += b[i].first - b[i-1].first;
    cout << ans << endl;
    return 0;
}
